ALMOST‐PRIME VALUES OF BINARY FORMS WITH ONE PRIME VARIABLE

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Powerfree Values of Binary Forms

Given a binary form f(x; y) 2 Z[x; y], we will be interested in nding the smallest k for which we can establish that there are in nitely many integers a and b such that f(a; b) is k free. Necessarily, we require the f has no xed kth prime power divisor. Until the nal section of this paper, we will also consider f to be irreducible. We set n = deg f . For k = 2, this problem has recently become ...

متن کامل

Prime sieves using binary quadratic forms

We introduce an algorithm that computes the prime numbers up to N using O(N/log logN) additions and N1/2+o(1) bits of memory. The algorithm enumerates representations of integers by certain binary quadratic forms. We present implementation results for this algorithm and one of the best previous algorithms.

متن کامل

Representation of Prime Powers by Binary Quadratic Forms

In this article, we consider the representation of prime powers by binary quadratic forms of discriminant D = −2q1 . . . qt where the product of primes q1 . . . qt ≡ 3 (mod 4), for instance if it is of special RichaudDegert type n2 ± 2 for odd n’s, n2 − 1 for even n’s. We consider all the ambiguous classes and Q( √|D0|), where D0 is the fundamental discriminant and we obtain a general criterion...

متن کامل

One-touch double barrier binary option values

The valuation and applications of one-touch double barrier binary options that include features of knock-out, knock-in, European and American style are described. Using a conventional Black Ð Scholes option-pricing environment, analytical solutions of the options are derived. The relationships among di€ erent types of one-touch double barrier binary options are discussed. An investor having a p...

متن کامل

Sums of Arithmetic Functions over Values of Binary Forms

Given a suitable arithmetic function h : N → R>0, and a binary form F ∈ Z[x1, x2], we investigate the average order of h as it ranges over the values taken by F . A general upper bound is obtained for this quantity, in which the dependence upon the coefficients of F is made completely explicit.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematika

سال: 2014

ISSN: 0025-5793,2041-7942

DOI: 10.1112/s002557931400031x